全文获取类型
收费全文 | 1438篇 |
免费 | 144篇 |
国内免费 | 95篇 |
专业分类
化学 | 62篇 |
晶体学 | 1篇 |
力学 | 59篇 |
综合类 | 26篇 |
数学 | 1354篇 |
物理学 | 175篇 |
出版年
2024年 | 1篇 |
2023年 | 22篇 |
2022年 | 36篇 |
2021年 | 30篇 |
2020年 | 61篇 |
2019年 | 47篇 |
2018年 | 52篇 |
2017年 | 53篇 |
2016年 | 44篇 |
2015年 | 32篇 |
2014年 | 64篇 |
2013年 | 108篇 |
2012年 | 78篇 |
2011年 | 107篇 |
2010年 | 86篇 |
2009年 | 130篇 |
2008年 | 120篇 |
2007年 | 71篇 |
2006年 | 101篇 |
2005年 | 69篇 |
2004年 | 62篇 |
2003年 | 45篇 |
2002年 | 45篇 |
2001年 | 37篇 |
2000年 | 33篇 |
1999年 | 29篇 |
1998年 | 30篇 |
1997年 | 22篇 |
1996年 | 11篇 |
1995年 | 13篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
排序方式: 共有1677条查询结果,搜索用时 93 毫秒
1.
2.
3.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic -edge-connected if every two distinct vertices of are connected by at least edge-disjoint monochromatic paths, and is said to be uniformly monochromatic -edge-connected if every two distinct vertices are connected by at least edge-disjoint monochromatic paths such that all edges of these paths are colored with a same color. We use and to denote the maximum number of colors that ensures to be monochromatic -edge-connected and, respectively, to be uniformly monochromatic -edge-connected. In this paper, we first conjecture that for any -edge-connected graph , , where is a minimum -edge-connected spanning subgraph of . We verify the conjecture for . We also prove the conjecture for and with . When is a minimal -edge-connected graph, we give an upper bound of , i.e., . For the uniformly monochromatic -edge-connectivity, we prove that for all , , where is a minimum -edge-connected spanning subgraph of . 相似文献
4.
原子在单色辐射作用下长时间内的行为研究 总被引:2,自引:1,他引:1
建立了原子在单色辐射作用下的模型,用微扰理论方法求解出原子处于两能级的几率.讨论了原子在单色辐射作用下长时间内的行为,得到了原子因辐射场的影响而变化的速率比能级的衰减速率大的情况下,原子在两能级间振荡,原子和辐射场相互作用越强,辐射场能够与原子发生作用的频率区间越宽,而且原子在单色光长时间辐射作用下高、低能级跃迁的速率不随时间而改变的结论. 相似文献
5.
6.
7.
Daniel C. Cohen Peter Orlik 《Transactions of the American Mathematical Society》2005,357(8):3031-3050
We study the Gauss-Manin connection for the moduli space of an arrangement of complex hyperplanes in the cohomology of a complex rank one local system. We define formal Gauss-Manin connection matrices in the Aomoto complex and prove that, for all arrangements and all local systems, these formal connection matrices specialize to Gauss-Manin connection matrices.
8.
I. Nakai 《Commentarii Mathematici Helvetici》1998,73(2):177-205
A curvilinear d-web W = (F
1 , . . . , F
d
) is a configuration of d curvilinear foliations F
i
on a surface. When d = 3, Bott connections of the normal bundles of F
i
extend naturally to equal affine connection, which is called Chern connection. For 3 < d, this is the case if and only if the modulus of tangents to the leaves of F
i
at a point is constant. A d-web is associative if the modulus is constant and weakly associative if Chern connections of all 3-subwebs have equal curvature form. We give a geometric interpretation of the curvature form
in terms of fake billiard in §2, and prove that a weakly associative d-web is associative if Chern connections of triples of the members are non flat, and then the foliations are defined by members
of a pencil (projective linear family of dim 1) of 1-forms. This result completes the classification of weakly associative
4-webs initiated by Poincaré, Mayrhofer and Reidemeister for the flat case. In §4, we generalize the result for n + 2-webs of n-spaces.
Received: September 23, 1996 相似文献
9.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
10.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献